[hal-00793906, v1] Codes and noncommutative stochastic matrices
نویسندگان
چکیده
Given a matrix over a skew field fixing the column t(1, . . . , 1), we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes.
منابع مشابه
Codes and Noncommutative Stochastic Matrices
Given a matrix over a skew field fixing the column .1; : : : ; 1/, we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes. Mathematics Subject Classification (2010). 16Z05, 05E15.
متن کامل[hal-00670720, v1] Weight Distributions of Multi-Edge type LDPC Codes
The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the densi...
متن کاملAsymptotic Nearness of Stochastic and Doubly-Stochastic Matrices
We prove that the set of n×n positive (row-)stochastic matrices and the corresponding set of doubly-stochastic matrices are asymptotically close. More specifically, random matrices within each of these classes are arbitrarily close in sufficiently high dimensions. AMS 2000 subject classifications:Primary 15A51,15A52,15A60, Stochastic Matrices. Let Sn denote the set of n × n stochastic matrices ...
متن کاملOn Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings
In this paper we study generalized Reed-Solomon codes (GRS codes) over commutative, noncommutative rings, show that the classical Welch-Berlekamp and Guruswami-Sudan decoding algorithms still hold in this context and we investigate their complexities. Under some hypothesis, the study of noncommutative generalized Reed-Solomon codes over finite rings leads to the fact that GRS code over commutat...
متن کاملChecking the strict positivity of Kraus maps is NP-hard
Basic properties in Perron-Frobenius theory are strict positivity, primitivity, and irreducibility. Whereas for nonnegative matrices, these properties are equivalent to elementary graph properties which can be checked in polynomial time, we show that for Kraus maps the noncommutative generalization of stochastic matrices checking strict positivity (whether the map sends the cone to its interior...
متن کامل